An Online Verifiable and Detectable (t, n) Multi-Secret Sharing Scheme Based on HS-TS

In 1979, secret sharing schemes were first proposed by Blakley and Shamir. In a secret sharing scheme, each participant receives a share of a secret in such a way that only authorized subsets can reconstruct the secret. Later, Wu and He proposed a (t, n)-threshold scheme for sharing a secret based on a hyperspherical function (HS-TS). Their scheme give a practical algorithm to solve the problem of dividing the secret into n shadows efficiently. However, the dealer must send new shares to each participant when the dealer shares a new secret. Hence the cost is high. In this paper, we propose a new online verifiable and detectable (t, n) multi-secret sharing scheme based on HS-TS (OVDHS-TS). The dealer need not redistribute fresh secret shares to every participant for next secret sharing session. It is a online secret sharing scheme with verification and detection. In addition, OVDHS-TS can be modified to be two new schemes, such that 1. It can verify the shares and detect the cheater, or 2. It can be used online only. Keywords–secret sharing scheme, hyperspherical, online, multi-secret sharing, verification and detec-